A Heuristic Algorithm for Capacity Sizing of Fixed Routing Multiservice Erlang Loss Networks
نویسندگان
چکیده
This paper deals with optimum link capacity sizing in Erlang multiservice loss networks with fixed routing. The objective function is link capacity installation cost which is to be minimized subject to call blocking probability limits. We describe a new heuristic algorithm we use to find a close match solution to this optimization problem. The algorithm is based on knapsack reduced load approximation.
منابع مشابه
A Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem
In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملShared Path Protection in DWDM Mesh Networks
Failure of even a single fiber link in DWDM mesh networks can cause severe data and revenue loss due to failure of several lightpaths of high bandwidth. This paper investigates this problem using shared path protection technique. First, we propose a link disjoint path finding heuristic, Multiple Active Path Search (MAPS) and show that it works even under trap topologies where conventional algor...
متن کاملA New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملA Reliable Routing Algorithm for Delay Sensitive Data in Body Area Networks
Wireless body Area networks (WBANs) include a number of sensor nodes placed inside or on the human body to improve patient health and quality of life. Ensuring the transfer and receipt of data in sensitive data is a very important issue. Routing algorithms should support a variety of service quality such as reliability and delay in sending and receiving data. Loss of information or excessive da...
متن کامل